P . A . Bernstein , Industrial Strength Schema Matching 1 Industrial Strength Schema Matching
نویسندگان
چکیده
The problem of creating mappings between schemas is an unavoidable and time-consuming step in the design of many types of large-scale commercial applications: in transaction processing and enterprise application integration, to help map messages between different XML formats; in data warehouses, to map data sources into warehouse schemas; and in web portals, to identify points of integration between heterogeneous databases. This position paper gives a brief summary of the state-of-the-art of schema matching and recommends platform development, rather than algorithm development, as the direction most likely to yield a significant improvement.
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملGeneric Schema Matching With Cupid Jayant Madhavan
ACM Trans. Database Syst. 30(2), 2005, 624-660. PDF, Jayant Madhavan, Philip A. Bernstein, Erhard Rahm Generic Schema Matching with Cupid VLDB'01 fragment research considering keith fixed jayant survey EVALUATION application 425 van 77–94 key matching printed christian errorm molina likelihood dynamic following arrow parent data madhavan heuristic strategie staab quantitative yanni recall 1000 ...
متن کاملThe Role of Schema Matching in Large Enterprises
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of data transfer. In this paper, we argue that schema matching plays valuable roles independent of mapping construction, especially as schemata grow to industrial scales. Specifically, in large enterprises human decision ...
متن کاملA Survey Of Approaches To Automatic Schema Matching Bibtex
ous business domains for automatic discovery, mediation and invocation of services over the Core or BibTEX. The use of such an Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB Journal: Very. BibTeX. @MISC(Rizopoulos_schemamatching, author = (Nikos Rizopoulos), 1126, A survey of approaches to automatic schema matching Rahm, Bernstein. The Linked Data paradigm ...
متن کاملGeneric Schema Matching with Cupid
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003